Termination proof of /tmp/tmpYRN6Am/PastaB17.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBC2FIG (⇒)

↳2 JBCTerminationGraph

↳3 FIGtoITRSProof (⇒)

↳4 IDP

↳5 IDPNonInfProof (⇒)

↳6 AND

    ↳7 IDP

        ↳8 IDependencyGraphProof (⇔)

        ↳9 IDP

        ↳10 IDPNonInfProof (⇒)

        ↳11 IDP

        ↳12 IDependencyGraphProof (⇔)

        ↳13 TRUE

    ↳14 IDP

        ↳15 IDependencyGraphProof (⇔)

        ↳16 IDP

        ↳17 IDPNonInfProof (⇒)

        ↳18 AND

            ↳19 IDP

                ↳20 IDependencyGraphProof (⇔)

                ↳21 TRUE

            ↳22 IDP

                ↳23 IDependencyGraphProof (⇔)

                ↳24 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_16 (Sun Microsystems Inc.) Main-Class: PastaB17

/**
 * Example taken from "A Term Rewriting Approach to the Automated Termination
 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
 * and converted to Java.
 */

public class PastaB17 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();
        int z = Random.random();

        while (x > z) {
            while (y > z) {
                y--;
            }
            x--;
        }
    }
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}

(1) JBC2FIG (SOUND transformation)

Constructed FIGraph.

(2) Obligation:

FIGraph based on JBC Program:
PastaB17.main([Ljava/lang/String;)V: Graph of 233 nodes with 1 SCC.

(3) FIGtoITRSProof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Logs:

Log for SCC 0:

Generated 16 rules for P and 2 rules for R.

Combined rules. Obtained 2 rules for P and 0 rules for R.

Filtered ground terms:

1262_0_main_LE(x1, x2, x3, x4, x5, x6) → 1262_0_main_LE(x2, x3, x4, x5, x6)
Cond_1262_0_main_LE1(x1, x2, x3, x4, x5, x6, x7) → Cond_1262_0_main_LE1(x1, x3, x4, x5, x6, x7)
Cond_1262_0_main_LE(x1, x2, x3, x4, x5, x6, x7) → Cond_1262_0_main_LE(x1, x3, x4, x5, x6, x7)

Filtered duplicate args:

1262_0_main_LE(x1, x2, x3, x4, x5) → 1262_0_main_LE(x1, x4, x5)
Cond_1262_0_main_LE1(x1, x2, x3, x4, x5, x6) → Cond_1262_0_main_LE1(x1, x2, x5, x6)
Cond_1262_0_main_LE(x1, x2, x3, x4, x5, x6) → Cond_1262_0_main_LE(x1, x2, x5, x6)

Combined rules. Obtained 2 rules for P and 0 rules for R.

Finished conversion. Obtained 2 rules for P and 0 rules for R. System has predefined symbols.

(4) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(x2[0] >= x1[0] && x2[0] < x0[0] + -1, x0[0], x1[0], x2[0])
(1): COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(x0[1] + -1, x1[1], x2[1])
(2): 1262_0_MAIN_LE(x0[2], x1[2], x2[2]) → COND_1262_0_MAIN_LE1(x2[2] < x1[2], x0[2], x1[2], x2[2])
(3): COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3]) → 1262_0_MAIN_LE(x0[3], x1[3] + -1, x2[3])

(0) -> (1), if ((x2[0] >= x1[0] && x2[0] < x0[0] + -1 →^* TRUE)∧(x0[0] →^* x0[1])∧(x1[0] →^* x1[1])∧(x2[0] →^* x2[1]))

(1) -> (0), if ((x0[1] + -1 →^* x0[0])∧(x1[1] →^* x1[0])∧(x2[1] →^* x2[0]))

(1) -> (2), if ((x0[1] + -1 →^* x0[2])∧(x1[1] →^* x1[2])∧(x2[1] →^* x2[2]))

(2) -> (3), if ((x2[2] < x1[2] →^* TRUE)∧(x0[2] →^* x0[3])∧(x1[2] →^* x1[3])∧(x2[2] →^* x2[3]))

(3) -> (0), if ((x0[3] →^* x0[0])∧(x1[3] + -1 →^* x1[0])∧(x2[3] →^* x2[0]))

(3) -> (2), if ((x0[3] →^* x0[2])∧(x1[3] + -1 →^* x1[2])∧(x2[3] →^* x2[2]))

The set Q is empty.

(5) IDPNonInfProof (SOUND transformation)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 1262_0_MAIN_LE(x0, x1, x2) → COND_1262_0_MAIN_LE(&&(>=(x2, x1), <(x2, +(x0, -1))), x0, x1, x2) the following chains were created:

We consider the chain 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0]), COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) which results in the following constraint:
(1)    (&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1)))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1] ⇒ 1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥NonInfC∧1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])∧(U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥))

We simplified constraint (1) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>=(x2[0], x1[0])=TRUE∧<(x2[0], +(x0[0], -1))=TRUE ⇒ 1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥NonInfC∧1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])∧(U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] + [bni_12]x1[0] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] + [bni_12]x1[0] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] + [bni_12]x1[0] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x2[0] ≥ 0∧x0[0] + [-2] + [-1]x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (7) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(8)    (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] ≥ 0∧[(-1)bso_13] ≥ 0)

(9)    (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] ≥ 0∧[(-1)bso_13] ≥ 0)

For Pair COND_1262_0_MAIN_LE(TRUE, x0, x1, x2) → 1262_0_MAIN_LE(+(x0, -1), x1, x2) the following chains were created:

We consider the chain COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) which results in the following constraint:
(10)    (COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1])≥NonInfC∧COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1])≥1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])∧(U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥))

We simplified constraint (10) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(11)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[(-1)bso_15] ≥ 0)

We simplified constraint (11) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(12)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[(-1)bso_15] ≥ 0)

We simplified constraint (12) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(13)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[(-1)bso_15] ≥ 0)

We simplified constraint (13) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(14)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_15] ≥ 0)

For Pair 1262_0_MAIN_LE(x0, x1, x2) → COND_1262_0_MAIN_LE1(<(x2, x1), x0, x1, x2) the following chains were created:

We consider the chain 1262_0_MAIN_LE(x0[2], x1[2], x2[2]) → COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2]), COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3]) → 1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3]) which results in the following constraint:
(15)    (<(x2[2], x1[2])=TRUE∧x0[2]=x0[3]∧x1[2]=x1[3]∧x2[2]=x2[3] ⇒ 1262_0_MAIN_LE(x0[2], x1[2], x2[2])≥NonInfC∧1262_0_MAIN_LE(x0[2], x1[2], x2[2])≥COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])∧(U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥))

We simplified constraint (15) using rule (IV) which results in the following new constraint:
(16)    (<(x2[2], x1[2])=TRUE ⇒ 1262_0_MAIN_LE(x0[2], x1[2], x2[2])≥NonInfC∧1262_0_MAIN_LE(x0[2], x1[2], x2[2])≥COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])∧(U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥))

We simplified constraint (16) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(17)    (x1[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [(-1)bni_16]x2[2] + [bni_16]x1[2] ≥ 0∧[(-1)bso_17] ≥ 0)

We simplified constraint (17) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(18)    (x1[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [(-1)bni_16]x2[2] + [bni_16]x1[2] ≥ 0∧[(-1)bso_17] ≥ 0)

We simplified constraint (18) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(19)    (x1[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧[(-1)bni_16 + (-1)Bound*bni_16] + [(-1)bni_16]x2[2] + [bni_16]x1[2] ≥ 0∧[(-1)bso_17] ≥ 0)

We simplified constraint (19) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(20)    (x1[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧0 = 0∧[(-1)bni_16 + (-1)Bound*bni_16] + [(-1)bni_16]x2[2] + [bni_16]x1[2] ≥ 0∧0 = 0∧[(-1)bso_17] ≥ 0)

We simplified constraint (20) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(21)    (x1[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧0 = 0∧[(-1)Bound*bni_16] + [bni_16]x1[2] ≥ 0∧0 = 0∧[(-1)bso_17] ≥ 0)

We simplified constraint (21) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(22)    (x1[2] ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧0 = 0∧[(-1)Bound*bni_16] + [bni_16]x1[2] ≥ 0∧0 = 0∧[(-1)bso_17] ≥ 0)

(23)    (x1[2] ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧0 = 0∧[(-1)Bound*bni_16] + [bni_16]x1[2] ≥ 0∧0 = 0∧[(-1)bso_17] ≥ 0)

For Pair COND_1262_0_MAIN_LE1(TRUE, x0, x1, x2) → 1262_0_MAIN_LE(x0, +(x1, -1), x2) the following chains were created:

We consider the chain COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3]) → 1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3]) which results in the following constraint:
(24)    (COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3])≥NonInfC∧COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3])≥1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])∧(U^Increasing(1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])), ≥))

We simplified constraint (24) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(25)    ((U^Increasing(1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])), ≥)∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (25) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(26)    ((U^Increasing(1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])), ≥)∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (26) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(27)    ((U^Increasing(1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])), ≥)∧[1 + (-1)bso_19] ≥ 0)

We simplified constraint (27) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(28)    ((U^Increasing(1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_19] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

1262_0_MAIN_LE(x0, x1, x2) → COND_1262_0_MAIN_LE(&&(>=(x2, x1), <(x2, +(x0, -1))), x0, x1, x2)
- (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] ≥ 0∧[(-1)bso_13] ≥ 0)
- (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[0] ≥ 0∧[(-1)bso_13] ≥ 0)
COND_1262_0_MAIN_LE(TRUE, x0, x1, x2) → 1262_0_MAIN_LE(+(x0, -1), x1, x2)
- ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_15] ≥ 0)
1262_0_MAIN_LE(x0, x1, x2) → COND_1262_0_MAIN_LE1(<(x2, x1), x0, x1, x2)
- (x1[2] ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧0 = 0∧[(-1)Bound*bni_16] + [bni_16]x1[2] ≥ 0∧0 = 0∧[(-1)bso_17] ≥ 0)
- (x1[2] ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])), ≥)∧0 = 0∧[(-1)Bound*bni_16] + [bni_16]x1[2] ≥ 0∧0 = 0∧[(-1)bso_17] ≥ 0)
COND_1262_0_MAIN_LE1(TRUE, x0, x1, x2) → 1262_0_MAIN_LE(x0, +(x1, -1), x2)
- ((U^Increasing(1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_19] ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(1262_0_MAIN_LE(x₁, x₂, x₃)) = [-1] + [-1]x₃ + x₂
POL(COND_1262_0_MAIN_LE(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + x₃
POL(&&(x₁, x₂)) = [-1]
POL(>=(x₁, x₂)) = [-1]
POL(<(x₁, x₂)) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(-1) = [-1]
POL(COND_1262_0_MAIN_LE1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + x₃

The following pairs are in P_>:

COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3]) → 1262_0_MAIN_LE(x0[3], +(x1[3], -1), x2[3])

The following pairs are in P_bound:

1262_0_MAIN_LE(x0[2], x1[2], x2[2]) → COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])

The following pairs are in P_≥:

1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])
COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])
1262_0_MAIN_LE(x0[2], x1[2], x2[2]) → COND_1262_0_MAIN_LE1(<(x2[2], x1[2]), x0[2], x1[2], x2[2])

There are no usable rules.

(6) Complex Obligation (AND)

(7) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

(1) -> (0), if ((x0[1] + -1 →^* x0[0])∧(x1[1] →^* x1[0])∧(x2[1] →^* x2[0]))

(0) -> (1), if ((x2[0] >= x1[0] && x2[0] < x0[0] + -1 →^* TRUE)∧(x0[0] →^* x0[1])∧(x1[0] →^* x1[1])∧(x2[0] →^* x2[1]))

(1) -> (2), if ((x0[1] + -1 →^* x0[2])∧(x1[1] →^* x1[2])∧(x2[1] →^* x2[2]))

The set Q is empty.

(8) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(9) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer, Boolean

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(x0[1] + -1, x1[1], x2[1])
(0): 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(x2[0] >= x1[0] && x2[0] < x0[0] + -1, x0[0], x1[0], x2[0])

(1) -> (0), if ((x0[1] + -1 →^* x0[0])∧(x1[1] →^* x1[0])∧(x2[1] →^* x2[0]))

(0) -> (1), if ((x2[0] >= x1[0] && x2[0] < x0[0] + -1 →^* TRUE)∧(x0[0] →^* x0[1])∧(x1[0] →^* x1[1])∧(x2[0] →^* x2[1]))

The set Q is empty.

(10) IDPNonInfProof (SOUND transformation)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) the following chains were created:

We consider the chain COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) which results in the following constraint:
(1)    (COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1])≥NonInfC∧COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1])≥1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])∧(U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥))

We simplified constraint (1) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[(-1)bso_12] ≥ 0)

We simplified constraint (2) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(3)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[(-1)bso_12] ≥ 0)

We simplified constraint (3) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(4)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[(-1)bso_12] ≥ 0)

We simplified constraint (4) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(5)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_12] ≥ 0)

For Pair 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0]) the following chains were created:

We consider the chain 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0]), COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) which results in the following constraint:
(6)    (&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1)))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1] ⇒ 1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥NonInfC∧1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])∧(U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥))

We simplified constraint (6) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(7)    (>=(x2[0], x1[0])=TRUE∧<(x2[0], +(x0[0], -1))=TRUE ⇒ 1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥NonInfC∧1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])∧(U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥))

We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(8)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_13 + (-1)Bound*bni_13] + [(2)bni_13]x0[0] + [(-1)bni_13]x2[0] + [(-1)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(9)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_13 + (-1)Bound*bni_13] + [(2)bni_13]x0[0] + [(-1)bni_13]x2[0] + [(-1)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(10)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_13 + (-1)Bound*bni_13] + [(2)bni_13]x0[0] + [(-1)bni_13]x2[0] + [(-1)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

We simplified constraint (10) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(11)    (x2[0] ≥ 0∧x0[0] + [-2] + [-1]x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_13 + (-1)Bound*bni_13] + [(2)bni_13]x0[0] + [(-2)bni_13]x1[0] + [(-1)bni_13]x2[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

We simplified constraint (11) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(12)    (x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(5)bni_13 + (-1)Bound*bni_13] + [bni_13]x2[0] + [(2)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

We simplified constraint (12) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(13)    (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(5)bni_13 + (-1)Bound*bni_13] + [bni_13]x2[0] + [(2)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

(14)    (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(5)bni_13 + (-1)Bound*bni_13] + [bni_13]x2[0] + [(2)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])
- ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_12] ≥ 0)
1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])
- (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(5)bni_13 + (-1)Bound*bni_13] + [bni_13]x2[0] + [(2)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)
- (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(5)bni_13 + (-1)Bound*bni_13] + [bni_13]x2[0] + [(2)bni_13]x1[0] ≥ 0∧[2 + (-1)bso_14] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(COND_1262_0_MAIN_LE(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + [-1]x₃ + [2]x₂
POL(1262_0_MAIN_LE(x₁, x₂, x₃)) = [1] + [2]x₁ + [-1]x₃ + [-1]x₂
POL(+(x₁, x₂)) = x₁ + x₂
POL(-1) = [-1]
POL(&&(x₁, x₂)) = [-1]
POL(>=(x₁, x₂)) = [-1]
POL(<(x₁, x₂)) = [-1]

The following pairs are in P_>:

1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])

The following pairs are in P_bound:

1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])

The following pairs are in P_≥:

COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])

There are no usable rules.

(11) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(x0[1] + -1, x1[1], x2[1])

The set Q is empty.

(12) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(13) TRUE

(14) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(x2[0] >= x1[0] && x2[0] < x0[0] + -1, x0[0], x1[0], x2[0])
(1): COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(x0[1] + -1, x1[1], x2[1])
(3): COND_1262_0_MAIN_LE1(TRUE, x0[3], x1[3], x2[3]) → 1262_0_MAIN_LE(x0[3], x1[3] + -1, x2[3])

(1) -> (0), if ((x0[1] + -1 →^* x0[0])∧(x1[1] →^* x1[0])∧(x2[1] →^* x2[0]))

(3) -> (0), if ((x0[3] →^* x0[0])∧(x1[3] + -1 →^* x1[0])∧(x2[3] →^* x2[0]))

(0) -> (1), if ((x2[0] >= x1[0] && x2[0] < x0[0] + -1 →^* TRUE)∧(x0[0] →^* x0[1])∧(x1[0] →^* x1[1])∧(x2[0] →^* x2[1]))

The set Q is empty.

(15) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(16) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer, Boolean

(1) -> (0), if ((x0[1] + -1 →^* x0[0])∧(x1[1] →^* x1[0])∧(x2[1] →^* x2[0]))

(0) -> (1), if ((x2[0] >= x1[0] && x2[0] < x0[0] + -1 →^* TRUE)∧(x0[0] →^* x0[1])∧(x1[0] →^* x1[1])∧(x2[0] →^* x2[1]))

The set Q is empty.

(17) IDPNonInfProof (SOUND transformation)

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) the following chains were created:

We consider the chain COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) which results in the following constraint:
(1)    (COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1])≥NonInfC∧COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1])≥1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])∧(U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥))

We simplified constraint (1) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[1 + (-1)bso_9] ≥ 0)

We simplified constraint (2) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(3)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[1 + (-1)bso_9] ≥ 0)

We simplified constraint (3) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(4)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧[1 + (-1)bso_9] ≥ 0)

We simplified constraint (4) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(5)    ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_9] ≥ 0)

For Pair 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0]) the following chains were created:

We consider the chain 1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0]), COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1]) which results in the following constraint:
(6)    (&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1)))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1] ⇒ 1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥NonInfC∧1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])∧(U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥))

We simplified constraint (6) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(7)    (>=(x2[0], x1[0])=TRUE∧<(x2[0], +(x0[0], -1))=TRUE ⇒ 1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥NonInfC∧1262_0_MAIN_LE(x0[0], x1[0], x2[0])≥COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])∧(U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥))

We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(8)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [bni_10]x0[0] + [(-1)bni_10]x2[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(9)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [bni_10]x0[0] + [(-1)bni_10]x2[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(10)    (x2[0] + [-1]x1[0] ≥ 0∧x0[0] + [-2] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [bni_10]x0[0] + [(-1)bni_10]x2[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (10) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(11)    (x2[0] ≥ 0∧x0[0] + [-2] + [-1]x1[0] + [-1]x2[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[(-1)bni_10 + (-1)Bound*bni_10] + [bni_10]x0[0] + [(-1)bni_10]x1[0] + [(-1)bni_10]x2[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (11) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(12)    (x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

We simplified constraint (12) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(13)    (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

(14)    (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])
- ((U^Increasing(1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_9] ≥ 0)
1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])
- (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)
- (x2[0] ≥ 0∧x1[0] ≥ 0∧x0[0] ≥ 0 ⇒ (U^Increasing(COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])), ≥)∧[bni_10 + (-1)Bound*bni_10] + [bni_10]x1[0] ≥ 0∧[(-1)bso_11] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(COND_1262_0_MAIN_LE(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + x₂
POL(1262_0_MAIN_LE(x₁, x₂, x₃)) = [-1] + x₁ + [-1]x₃
POL(+(x₁, x₂)) = x₁ + x₂
POL(-1) = [-1]
POL(&&(x₁, x₂)) = 0
POL(>=(x₁, x₂)) = [1]
POL(<(x₁, x₂)) = [-1]

The following pairs are in P_>:

COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(+(x0[1], -1), x1[1], x2[1])

The following pairs are in P_bound:

1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])

The following pairs are in P_≥:

1262_0_MAIN_LE(x0[0], x1[0], x2[0]) → COND_1262_0_MAIN_LE(&&(>=(x2[0], x1[0]), <(x2[0], +(x0[0], -1))), x0[0], x1[0], x2[0])

There are no usable rules.

(18) Complex Obligation (AND)

(19) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

(20) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(21) TRUE

(22) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_1262_0_MAIN_LE(TRUE, x0[1], x1[1], x2[1]) → 1262_0_MAIN_LE(x0[1] + -1, x1[1], x2[1])

The set Q is empty.

(23) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(0) Obligation:

(1) JBC2FIG (SOUND transformation)

(2) Obligation:

(3) FIGtoITRSProof (SOUND transformation)

(4) Obligation:

(5) IDPNonInfProof (SOUND transformation)

(6) Complex Obligation (AND)

(7) Obligation:

(8) IDependencyGraphProof (EQUIVALENT transformation)

(9) Obligation:

(10) IDPNonInfProof (SOUND transformation)

(11) Obligation:

(12) IDependencyGraphProof (EQUIVALENT transformation)

(13) TRUE

(14) Obligation:

(15) IDependencyGraphProof (EQUIVALENT transformation)

(16) Obligation:

(17) IDPNonInfProof (SOUND transformation)

(18) Complex Obligation (AND)

(19) Obligation:

(20) IDependencyGraphProof (EQUIVALENT transformation)

(21) TRUE

(22) Obligation:

(23) IDependencyGraphProof (EQUIVALENT transformation)

(24) TRUE